(0) Obligation:

Clauses:

tappend(nil, T, T).
tappend(node(nil, X, T2), T1, node(T1, X, T2)).
tappend(node(T1, X, nil), T2, node(T1, X, T2)).
tappend(node(T1, X, T2), T3, node(U, X, T2)) :- tappend(T1, T3, U).
tappend(node(T1, X, T2), T3, node(T1, X, U)) :- tappend(T2, T3, U).
s2t(s(X), node(T, Y, T)) :- s2t(X, T).
s2t(s(X), node(nil, Y, T)) :- s2t(X, T).
s2t(s(X), node(T, Y, nil)) :- s2t(X, T).
s2t(s(X), node(nil, Y, nil)).
s2t(0, nil).
goal(X) :- ','(s2t(X, T1), tappend(T1, T2, T3)).

Query: goal(g)

(1) PrologToPrologProblemTransformerProof (SOUND transformation)

Built Prolog problem from termination graph ICLP10.

(2) Obligation:

Clauses:

s2tA(s(T19), node(X64, X65, X64)) :- s2tA(T19, X64).
s2tA(s(T25), node(nil, X94, X95)) :- s2tA(T25, X95).
s2tA(s(T31), node(X124, X125, nil)) :- s2tA(T31, X124).
s2tA(s(T37), node(nil, X145, nil)).
s2tA(0, nil).
tappendB(nil, X260, X260).
tappendB(node(nil, T59, T60), X280, node(X280, T59, T60)).
tappendB(node(T69, T70, nil), X300, node(T69, T70, X300)).
tappendB(node(T86, T84, T85), X334, node(X335, T84, T85)) :- tappendB(T86, X334, X335).
tappendB(node(T93, T94, T96), X359, node(T93, T94, X360)) :- tappendB(T96, X359, X360).
tappendC(nil, X172, X173, node(X173, X172, nil)).
tappendC(nil, X197, X198, node(nil, X197, X198)).
tappendC(T50, X244, X245, node(X246, X244, T50)) :- tappendB(T50, X245, X246).
tappendC(T101, X390, X391, node(T101, X390, X392)) :- tappendB(T101, X391, X392).
goalD(s(T11)) :- s2tA(T11, X29).
goalD(s(T11)) :- ','(s2tA(T11, T13), tappendC(T13, X30, X4, X5)).
goalD(s(T106)) :- s2tA(T106, X421).
goalD(s(T106)) :- ','(s2tA(T106, T108), tappendB(node(nil, X420, T108), X4, X5)).
goalD(s(T114)) :- s2tA(T114, X457).
goalD(s(T114)) :- ','(s2tA(T114, T116), tappendB(node(T116, X458, nil), X4, X5)).
goalD(s(T122)) :- tappendC(nil, X485, X4, X5).
goalD(0) :- tappendB(nil, X4, X5).

Query: goalD(g)

(3) PrologToPiTRSProof (SOUND transformation)

We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes:
goalD_in: (b)
s2tA_in: (b,f)
tappendC_in: (b,f,f,f)
tappendB_in: (b,f,f)
Transforming Prolog into the following Term Rewriting System:
Pi-finite rewrite system:
The TRS R consists of the following rules:

goalD_in_g(s(T11)) → U8_g(T11, s2tA_in_ga(T11, X29))
s2tA_in_ga(s(T19), node(X64, X65, X64)) → U1_ga(T19, X64, X65, s2tA_in_ga(T19, X64))
s2tA_in_ga(s(T25), node(nil, X94, X95)) → U2_ga(T25, X94, X95, s2tA_in_ga(T25, X95))
s2tA_in_ga(s(T31), node(X124, X125, nil)) → U3_ga(T31, X124, X125, s2tA_in_ga(T31, X124))
s2tA_in_ga(s(T37), node(nil, X145, nil)) → s2tA_out_ga(s(T37), node(nil, X145, nil))
s2tA_in_ga(0, nil) → s2tA_out_ga(0, nil)
U3_ga(T31, X124, X125, s2tA_out_ga(T31, X124)) → s2tA_out_ga(s(T31), node(X124, X125, nil))
U2_ga(T25, X94, X95, s2tA_out_ga(T25, X95)) → s2tA_out_ga(s(T25), node(nil, X94, X95))
U1_ga(T19, X64, X65, s2tA_out_ga(T19, X64)) → s2tA_out_ga(s(T19), node(X64, X65, X64))
U8_g(T11, s2tA_out_ga(T11, X29)) → goalD_out_g(s(T11))
goalD_in_g(s(T11)) → U9_g(T11, s2tA_in_ga(T11, T13))
U9_g(T11, s2tA_out_ga(T11, T13)) → U10_g(T11, tappendC_in_gaaa(T13, X30, X4, X5))
tappendC_in_gaaa(nil, X172, X173, node(X173, X172, nil)) → tappendC_out_gaaa(nil, X172, X173, node(X173, X172, nil))
tappendC_in_gaaa(nil, X197, X198, node(nil, X197, X198)) → tappendC_out_gaaa(nil, X197, X198, node(nil, X197, X198))
tappendC_in_gaaa(T50, X244, X245, node(X246, X244, T50)) → U6_gaaa(T50, X244, X245, X246, tappendB_in_gaa(T50, X245, X246))
tappendB_in_gaa(nil, X260, X260) → tappendB_out_gaa(nil, X260, X260)
tappendB_in_gaa(node(nil, T59, T60), X280, node(X280, T59, T60)) → tappendB_out_gaa(node(nil, T59, T60), X280, node(X280, T59, T60))
tappendB_in_gaa(node(T69, T70, nil), X300, node(T69, T70, X300)) → tappendB_out_gaa(node(T69, T70, nil), X300, node(T69, T70, X300))
tappendB_in_gaa(node(T86, T84, T85), X334, node(X335, T84, T85)) → U4_gaa(T86, T84, T85, X334, X335, tappendB_in_gaa(T86, X334, X335))
tappendB_in_gaa(node(T93, T94, T96), X359, node(T93, T94, X360)) → U5_gaa(T93, T94, T96, X359, X360, tappendB_in_gaa(T96, X359, X360))
U5_gaa(T93, T94, T96, X359, X360, tappendB_out_gaa(T96, X359, X360)) → tappendB_out_gaa(node(T93, T94, T96), X359, node(T93, T94, X360))
U4_gaa(T86, T84, T85, X334, X335, tappendB_out_gaa(T86, X334, X335)) → tappendB_out_gaa(node(T86, T84, T85), X334, node(X335, T84, T85))
U6_gaaa(T50, X244, X245, X246, tappendB_out_gaa(T50, X245, X246)) → tappendC_out_gaaa(T50, X244, X245, node(X246, X244, T50))
tappendC_in_gaaa(T101, X390, X391, node(T101, X390, X392)) → U7_gaaa(T101, X390, X391, X392, tappendB_in_gaa(T101, X391, X392))
U7_gaaa(T101, X390, X391, X392, tappendB_out_gaa(T101, X391, X392)) → tappendC_out_gaaa(T101, X390, X391, node(T101, X390, X392))
U10_g(T11, tappendC_out_gaaa(T13, X30, X4, X5)) → goalD_out_g(s(T11))
goalD_in_g(s(T106)) → U11_g(T106, s2tA_in_ga(T106, X421))
U11_g(T106, s2tA_out_ga(T106, X421)) → goalD_out_g(s(T106))
goalD_in_g(s(T106)) → U12_g(T106, s2tA_in_ga(T106, T108))
U12_g(T106, s2tA_out_ga(T106, T108)) → U13_g(T106, tappendB_in_gaa(node(nil, X420, T108), X4, X5))
U13_g(T106, tappendB_out_gaa(node(nil, X420, T108), X4, X5)) → goalD_out_g(s(T106))
goalD_in_g(s(T114)) → U14_g(T114, s2tA_in_ga(T114, X457))
U14_g(T114, s2tA_out_ga(T114, X457)) → goalD_out_g(s(T114))
goalD_in_g(s(T114)) → U15_g(T114, s2tA_in_ga(T114, T116))
U15_g(T114, s2tA_out_ga(T114, T116)) → U16_g(T114, tappendB_in_gaa(node(T116, X458, nil), X4, X5))
U16_g(T114, tappendB_out_gaa(node(T116, X458, nil), X4, X5)) → goalD_out_g(s(T114))
goalD_in_g(s(T122)) → U17_g(T122, tappendC_in_gaaa(nil, X485, X4, X5))
U17_g(T122, tappendC_out_gaaa(nil, X485, X4, X5)) → goalD_out_g(s(T122))
goalD_in_g(0) → U18_g(tappendB_in_gaa(nil, X4, X5))
U18_g(tappendB_out_gaa(nil, X4, X5)) → goalD_out_g(0)

The argument filtering Pi contains the following mapping:
goalD_in_g(x1)  =  goalD_in_g(x1)
s(x1)  =  s(x1)
U8_g(x1, x2)  =  U8_g(x2)
s2tA_in_ga(x1, x2)  =  s2tA_in_ga(x1)
U1_ga(x1, x2, x3, x4)  =  U1_ga(x4)
U2_ga(x1, x2, x3, x4)  =  U2_ga(x4)
U3_ga(x1, x2, x3, x4)  =  U3_ga(x4)
s2tA_out_ga(x1, x2)  =  s2tA_out_ga(x2)
node(x1, x2, x3)  =  node(x1, x3)
0  =  0
goalD_out_g(x1)  =  goalD_out_g
U9_g(x1, x2)  =  U9_g(x2)
U10_g(x1, x2)  =  U10_g(x2)
tappendC_in_gaaa(x1, x2, x3, x4)  =  tappendC_in_gaaa(x1)
nil  =  nil
tappendC_out_gaaa(x1, x2, x3, x4)  =  tappendC_out_gaaa
U6_gaaa(x1, x2, x3, x4, x5)  =  U6_gaaa(x5)
tappendB_in_gaa(x1, x2, x3)  =  tappendB_in_gaa(x1)
tappendB_out_gaa(x1, x2, x3)  =  tappendB_out_gaa
U4_gaa(x1, x2, x3, x4, x5, x6)  =  U4_gaa(x6)
U5_gaa(x1, x2, x3, x4, x5, x6)  =  U5_gaa(x6)
U7_gaaa(x1, x2, x3, x4, x5)  =  U7_gaaa(x5)
U11_g(x1, x2)  =  U11_g(x2)
U12_g(x1, x2)  =  U12_g(x2)
U13_g(x1, x2)  =  U13_g(x2)
U14_g(x1, x2)  =  U14_g(x2)
U15_g(x1, x2)  =  U15_g(x2)
U16_g(x1, x2)  =  U16_g(x2)
U17_g(x1, x2)  =  U17_g(x2)
U18_g(x1)  =  U18_g(x1)

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog

(4) Obligation:

Pi-finite rewrite system:
The TRS R consists of the following rules:

goalD_in_g(s(T11)) → U8_g(T11, s2tA_in_ga(T11, X29))
s2tA_in_ga(s(T19), node(X64, X65, X64)) → U1_ga(T19, X64, X65, s2tA_in_ga(T19, X64))
s2tA_in_ga(s(T25), node(nil, X94, X95)) → U2_ga(T25, X94, X95, s2tA_in_ga(T25, X95))
s2tA_in_ga(s(T31), node(X124, X125, nil)) → U3_ga(T31, X124, X125, s2tA_in_ga(T31, X124))
s2tA_in_ga(s(T37), node(nil, X145, nil)) → s2tA_out_ga(s(T37), node(nil, X145, nil))
s2tA_in_ga(0, nil) → s2tA_out_ga(0, nil)
U3_ga(T31, X124, X125, s2tA_out_ga(T31, X124)) → s2tA_out_ga(s(T31), node(X124, X125, nil))
U2_ga(T25, X94, X95, s2tA_out_ga(T25, X95)) → s2tA_out_ga(s(T25), node(nil, X94, X95))
U1_ga(T19, X64, X65, s2tA_out_ga(T19, X64)) → s2tA_out_ga(s(T19), node(X64, X65, X64))
U8_g(T11, s2tA_out_ga(T11, X29)) → goalD_out_g(s(T11))
goalD_in_g(s(T11)) → U9_g(T11, s2tA_in_ga(T11, T13))
U9_g(T11, s2tA_out_ga(T11, T13)) → U10_g(T11, tappendC_in_gaaa(T13, X30, X4, X5))
tappendC_in_gaaa(nil, X172, X173, node(X173, X172, nil)) → tappendC_out_gaaa(nil, X172, X173, node(X173, X172, nil))
tappendC_in_gaaa(nil, X197, X198, node(nil, X197, X198)) → tappendC_out_gaaa(nil, X197, X198, node(nil, X197, X198))
tappendC_in_gaaa(T50, X244, X245, node(X246, X244, T50)) → U6_gaaa(T50, X244, X245, X246, tappendB_in_gaa(T50, X245, X246))
tappendB_in_gaa(nil, X260, X260) → tappendB_out_gaa(nil, X260, X260)
tappendB_in_gaa(node(nil, T59, T60), X280, node(X280, T59, T60)) → tappendB_out_gaa(node(nil, T59, T60), X280, node(X280, T59, T60))
tappendB_in_gaa(node(T69, T70, nil), X300, node(T69, T70, X300)) → tappendB_out_gaa(node(T69, T70, nil), X300, node(T69, T70, X300))
tappendB_in_gaa(node(T86, T84, T85), X334, node(X335, T84, T85)) → U4_gaa(T86, T84, T85, X334, X335, tappendB_in_gaa(T86, X334, X335))
tappendB_in_gaa(node(T93, T94, T96), X359, node(T93, T94, X360)) → U5_gaa(T93, T94, T96, X359, X360, tappendB_in_gaa(T96, X359, X360))
U5_gaa(T93, T94, T96, X359, X360, tappendB_out_gaa(T96, X359, X360)) → tappendB_out_gaa(node(T93, T94, T96), X359, node(T93, T94, X360))
U4_gaa(T86, T84, T85, X334, X335, tappendB_out_gaa(T86, X334, X335)) → tappendB_out_gaa(node(T86, T84, T85), X334, node(X335, T84, T85))
U6_gaaa(T50, X244, X245, X246, tappendB_out_gaa(T50, X245, X246)) → tappendC_out_gaaa(T50, X244, X245, node(X246, X244, T50))
tappendC_in_gaaa(T101, X390, X391, node(T101, X390, X392)) → U7_gaaa(T101, X390, X391, X392, tappendB_in_gaa(T101, X391, X392))
U7_gaaa(T101, X390, X391, X392, tappendB_out_gaa(T101, X391, X392)) → tappendC_out_gaaa(T101, X390, X391, node(T101, X390, X392))
U10_g(T11, tappendC_out_gaaa(T13, X30, X4, X5)) → goalD_out_g(s(T11))
goalD_in_g(s(T106)) → U11_g(T106, s2tA_in_ga(T106, X421))
U11_g(T106, s2tA_out_ga(T106, X421)) → goalD_out_g(s(T106))
goalD_in_g(s(T106)) → U12_g(T106, s2tA_in_ga(T106, T108))
U12_g(T106, s2tA_out_ga(T106, T108)) → U13_g(T106, tappendB_in_gaa(node(nil, X420, T108), X4, X5))
U13_g(T106, tappendB_out_gaa(node(nil, X420, T108), X4, X5)) → goalD_out_g(s(T106))
goalD_in_g(s(T114)) → U14_g(T114, s2tA_in_ga(T114, X457))
U14_g(T114, s2tA_out_ga(T114, X457)) → goalD_out_g(s(T114))
goalD_in_g(s(T114)) → U15_g(T114, s2tA_in_ga(T114, T116))
U15_g(T114, s2tA_out_ga(T114, T116)) → U16_g(T114, tappendB_in_gaa(node(T116, X458, nil), X4, X5))
U16_g(T114, tappendB_out_gaa(node(T116, X458, nil), X4, X5)) → goalD_out_g(s(T114))
goalD_in_g(s(T122)) → U17_g(T122, tappendC_in_gaaa(nil, X485, X4, X5))
U17_g(T122, tappendC_out_gaaa(nil, X485, X4, X5)) → goalD_out_g(s(T122))
goalD_in_g(0) → U18_g(tappendB_in_gaa(nil, X4, X5))
U18_g(tappendB_out_gaa(nil, X4, X5)) → goalD_out_g(0)

The argument filtering Pi contains the following mapping:
goalD_in_g(x1)  =  goalD_in_g(x1)
s(x1)  =  s(x1)
U8_g(x1, x2)  =  U8_g(x2)
s2tA_in_ga(x1, x2)  =  s2tA_in_ga(x1)
U1_ga(x1, x2, x3, x4)  =  U1_ga(x4)
U2_ga(x1, x2, x3, x4)  =  U2_ga(x4)
U3_ga(x1, x2, x3, x4)  =  U3_ga(x4)
s2tA_out_ga(x1, x2)  =  s2tA_out_ga(x2)
node(x1, x2, x3)  =  node(x1, x3)
0  =  0
goalD_out_g(x1)  =  goalD_out_g
U9_g(x1, x2)  =  U9_g(x2)
U10_g(x1, x2)  =  U10_g(x2)
tappendC_in_gaaa(x1, x2, x3, x4)  =  tappendC_in_gaaa(x1)
nil  =  nil
tappendC_out_gaaa(x1, x2, x3, x4)  =  tappendC_out_gaaa
U6_gaaa(x1, x2, x3, x4, x5)  =  U6_gaaa(x5)
tappendB_in_gaa(x1, x2, x3)  =  tappendB_in_gaa(x1)
tappendB_out_gaa(x1, x2, x3)  =  tappendB_out_gaa
U4_gaa(x1, x2, x3, x4, x5, x6)  =  U4_gaa(x6)
U5_gaa(x1, x2, x3, x4, x5, x6)  =  U5_gaa(x6)
U7_gaaa(x1, x2, x3, x4, x5)  =  U7_gaaa(x5)
U11_g(x1, x2)  =  U11_g(x2)
U12_g(x1, x2)  =  U12_g(x2)
U13_g(x1, x2)  =  U13_g(x2)
U14_g(x1, x2)  =  U14_g(x2)
U15_g(x1, x2)  =  U15_g(x2)
U16_g(x1, x2)  =  U16_g(x2)
U17_g(x1, x2)  =  U17_g(x2)
U18_g(x1)  =  U18_g(x1)

(5) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LOPSTR] we result in the following initial DP problem:
Pi DP problem:
The TRS P consists of the following rules:

GOALD_IN_G(s(T11)) → U8_G(T11, s2tA_in_ga(T11, X29))
GOALD_IN_G(s(T11)) → S2TA_IN_GA(T11, X29)
S2TA_IN_GA(s(T19), node(X64, X65, X64)) → U1_GA(T19, X64, X65, s2tA_in_ga(T19, X64))
S2TA_IN_GA(s(T19), node(X64, X65, X64)) → S2TA_IN_GA(T19, X64)
S2TA_IN_GA(s(T25), node(nil, X94, X95)) → U2_GA(T25, X94, X95, s2tA_in_ga(T25, X95))
S2TA_IN_GA(s(T25), node(nil, X94, X95)) → S2TA_IN_GA(T25, X95)
S2TA_IN_GA(s(T31), node(X124, X125, nil)) → U3_GA(T31, X124, X125, s2tA_in_ga(T31, X124))
S2TA_IN_GA(s(T31), node(X124, X125, nil)) → S2TA_IN_GA(T31, X124)
GOALD_IN_G(s(T11)) → U9_G(T11, s2tA_in_ga(T11, T13))
U9_G(T11, s2tA_out_ga(T11, T13)) → U10_G(T11, tappendC_in_gaaa(T13, X30, X4, X5))
U9_G(T11, s2tA_out_ga(T11, T13)) → TAPPENDC_IN_GAAA(T13, X30, X4, X5)
TAPPENDC_IN_GAAA(T50, X244, X245, node(X246, X244, T50)) → U6_GAAA(T50, X244, X245, X246, tappendB_in_gaa(T50, X245, X246))
TAPPENDC_IN_GAAA(T50, X244, X245, node(X246, X244, T50)) → TAPPENDB_IN_GAA(T50, X245, X246)
TAPPENDB_IN_GAA(node(T86, T84, T85), X334, node(X335, T84, T85)) → U4_GAA(T86, T84, T85, X334, X335, tappendB_in_gaa(T86, X334, X335))
TAPPENDB_IN_GAA(node(T86, T84, T85), X334, node(X335, T84, T85)) → TAPPENDB_IN_GAA(T86, X334, X335)
TAPPENDB_IN_GAA(node(T93, T94, T96), X359, node(T93, T94, X360)) → U5_GAA(T93, T94, T96, X359, X360, tappendB_in_gaa(T96, X359, X360))
TAPPENDB_IN_GAA(node(T93, T94, T96), X359, node(T93, T94, X360)) → TAPPENDB_IN_GAA(T96, X359, X360)
TAPPENDC_IN_GAAA(T101, X390, X391, node(T101, X390, X392)) → U7_GAAA(T101, X390, X391, X392, tappendB_in_gaa(T101, X391, X392))
TAPPENDC_IN_GAAA(T101, X390, X391, node(T101, X390, X392)) → TAPPENDB_IN_GAA(T101, X391, X392)
GOALD_IN_G(s(T106)) → U11_G(T106, s2tA_in_ga(T106, X421))
GOALD_IN_G(s(T106)) → U12_G(T106, s2tA_in_ga(T106, T108))
U12_G(T106, s2tA_out_ga(T106, T108)) → U13_G(T106, tappendB_in_gaa(node(nil, X420, T108), X4, X5))
U12_G(T106, s2tA_out_ga(T106, T108)) → TAPPENDB_IN_GAA(node(nil, X420, T108), X4, X5)
GOALD_IN_G(s(T114)) → U14_G(T114, s2tA_in_ga(T114, X457))
GOALD_IN_G(s(T114)) → U15_G(T114, s2tA_in_ga(T114, T116))
U15_G(T114, s2tA_out_ga(T114, T116)) → U16_G(T114, tappendB_in_gaa(node(T116, X458, nil), X4, X5))
U15_G(T114, s2tA_out_ga(T114, T116)) → TAPPENDB_IN_GAA(node(T116, X458, nil), X4, X5)
GOALD_IN_G(s(T122)) → U17_G(T122, tappendC_in_gaaa(nil, X485, X4, X5))
GOALD_IN_G(s(T122)) → TAPPENDC_IN_GAAA(nil, X485, X4, X5)
GOALD_IN_G(0) → U18_G(tappendB_in_gaa(nil, X4, X5))
GOALD_IN_G(0) → TAPPENDB_IN_GAA(nil, X4, X5)

The TRS R consists of the following rules:

goalD_in_g(s(T11)) → U8_g(T11, s2tA_in_ga(T11, X29))
s2tA_in_ga(s(T19), node(X64, X65, X64)) → U1_ga(T19, X64, X65, s2tA_in_ga(T19, X64))
s2tA_in_ga(s(T25), node(nil, X94, X95)) → U2_ga(T25, X94, X95, s2tA_in_ga(T25, X95))
s2tA_in_ga(s(T31), node(X124, X125, nil)) → U3_ga(T31, X124, X125, s2tA_in_ga(T31, X124))
s2tA_in_ga(s(T37), node(nil, X145, nil)) → s2tA_out_ga(s(T37), node(nil, X145, nil))
s2tA_in_ga(0, nil) → s2tA_out_ga(0, nil)
U3_ga(T31, X124, X125, s2tA_out_ga(T31, X124)) → s2tA_out_ga(s(T31), node(X124, X125, nil))
U2_ga(T25, X94, X95, s2tA_out_ga(T25, X95)) → s2tA_out_ga(s(T25), node(nil, X94, X95))
U1_ga(T19, X64, X65, s2tA_out_ga(T19, X64)) → s2tA_out_ga(s(T19), node(X64, X65, X64))
U8_g(T11, s2tA_out_ga(T11, X29)) → goalD_out_g(s(T11))
goalD_in_g(s(T11)) → U9_g(T11, s2tA_in_ga(T11, T13))
U9_g(T11, s2tA_out_ga(T11, T13)) → U10_g(T11, tappendC_in_gaaa(T13, X30, X4, X5))
tappendC_in_gaaa(nil, X172, X173, node(X173, X172, nil)) → tappendC_out_gaaa(nil, X172, X173, node(X173, X172, nil))
tappendC_in_gaaa(nil, X197, X198, node(nil, X197, X198)) → tappendC_out_gaaa(nil, X197, X198, node(nil, X197, X198))
tappendC_in_gaaa(T50, X244, X245, node(X246, X244, T50)) → U6_gaaa(T50, X244, X245, X246, tappendB_in_gaa(T50, X245, X246))
tappendB_in_gaa(nil, X260, X260) → tappendB_out_gaa(nil, X260, X260)
tappendB_in_gaa(node(nil, T59, T60), X280, node(X280, T59, T60)) → tappendB_out_gaa(node(nil, T59, T60), X280, node(X280, T59, T60))
tappendB_in_gaa(node(T69, T70, nil), X300, node(T69, T70, X300)) → tappendB_out_gaa(node(T69, T70, nil), X300, node(T69, T70, X300))
tappendB_in_gaa(node(T86, T84, T85), X334, node(X335, T84, T85)) → U4_gaa(T86, T84, T85, X334, X335, tappendB_in_gaa(T86, X334, X335))
tappendB_in_gaa(node(T93, T94, T96), X359, node(T93, T94, X360)) → U5_gaa(T93, T94, T96, X359, X360, tappendB_in_gaa(T96, X359, X360))
U5_gaa(T93, T94, T96, X359, X360, tappendB_out_gaa(T96, X359, X360)) → tappendB_out_gaa(node(T93, T94, T96), X359, node(T93, T94, X360))
U4_gaa(T86, T84, T85, X334, X335, tappendB_out_gaa(T86, X334, X335)) → tappendB_out_gaa(node(T86, T84, T85), X334, node(X335, T84, T85))
U6_gaaa(T50, X244, X245, X246, tappendB_out_gaa(T50, X245, X246)) → tappendC_out_gaaa(T50, X244, X245, node(X246, X244, T50))
tappendC_in_gaaa(T101, X390, X391, node(T101, X390, X392)) → U7_gaaa(T101, X390, X391, X392, tappendB_in_gaa(T101, X391, X392))
U7_gaaa(T101, X390, X391, X392, tappendB_out_gaa(T101, X391, X392)) → tappendC_out_gaaa(T101, X390, X391, node(T101, X390, X392))
U10_g(T11, tappendC_out_gaaa(T13, X30, X4, X5)) → goalD_out_g(s(T11))
goalD_in_g(s(T106)) → U11_g(T106, s2tA_in_ga(T106, X421))
U11_g(T106, s2tA_out_ga(T106, X421)) → goalD_out_g(s(T106))
goalD_in_g(s(T106)) → U12_g(T106, s2tA_in_ga(T106, T108))
U12_g(T106, s2tA_out_ga(T106, T108)) → U13_g(T106, tappendB_in_gaa(node(nil, X420, T108), X4, X5))
U13_g(T106, tappendB_out_gaa(node(nil, X420, T108), X4, X5)) → goalD_out_g(s(T106))
goalD_in_g(s(T114)) → U14_g(T114, s2tA_in_ga(T114, X457))
U14_g(T114, s2tA_out_ga(T114, X457)) → goalD_out_g(s(T114))
goalD_in_g(s(T114)) → U15_g(T114, s2tA_in_ga(T114, T116))
U15_g(T114, s2tA_out_ga(T114, T116)) → U16_g(T114, tappendB_in_gaa(node(T116, X458, nil), X4, X5))
U16_g(T114, tappendB_out_gaa(node(T116, X458, nil), X4, X5)) → goalD_out_g(s(T114))
goalD_in_g(s(T122)) → U17_g(T122, tappendC_in_gaaa(nil, X485, X4, X5))
U17_g(T122, tappendC_out_gaaa(nil, X485, X4, X5)) → goalD_out_g(s(T122))
goalD_in_g(0) → U18_g(tappendB_in_gaa(nil, X4, X5))
U18_g(tappendB_out_gaa(nil, X4, X5)) → goalD_out_g(0)

The argument filtering Pi contains the following mapping:
goalD_in_g(x1)  =  goalD_in_g(x1)
s(x1)  =  s(x1)
U8_g(x1, x2)  =  U8_g(x2)
s2tA_in_ga(x1, x2)  =  s2tA_in_ga(x1)
U1_ga(x1, x2, x3, x4)  =  U1_ga(x4)
U2_ga(x1, x2, x3, x4)  =  U2_ga(x4)
U3_ga(x1, x2, x3, x4)  =  U3_ga(x4)
s2tA_out_ga(x1, x2)  =  s2tA_out_ga(x2)
node(x1, x2, x3)  =  node(x1, x3)
0  =  0
goalD_out_g(x1)  =  goalD_out_g
U9_g(x1, x2)  =  U9_g(x2)
U10_g(x1, x2)  =  U10_g(x2)
tappendC_in_gaaa(x1, x2, x3, x4)  =  tappendC_in_gaaa(x1)
nil  =  nil
tappendC_out_gaaa(x1, x2, x3, x4)  =  tappendC_out_gaaa
U6_gaaa(x1, x2, x3, x4, x5)  =  U6_gaaa(x5)
tappendB_in_gaa(x1, x2, x3)  =  tappendB_in_gaa(x1)
tappendB_out_gaa(x1, x2, x3)  =  tappendB_out_gaa
U4_gaa(x1, x2, x3, x4, x5, x6)  =  U4_gaa(x6)
U5_gaa(x1, x2, x3, x4, x5, x6)  =  U5_gaa(x6)
U7_gaaa(x1, x2, x3, x4, x5)  =  U7_gaaa(x5)
U11_g(x1, x2)  =  U11_g(x2)
U12_g(x1, x2)  =  U12_g(x2)
U13_g(x1, x2)  =  U13_g(x2)
U14_g(x1, x2)  =  U14_g(x2)
U15_g(x1, x2)  =  U15_g(x2)
U16_g(x1, x2)  =  U16_g(x2)
U17_g(x1, x2)  =  U17_g(x2)
U18_g(x1)  =  U18_g(x1)
GOALD_IN_G(x1)  =  GOALD_IN_G(x1)
U8_G(x1, x2)  =  U8_G(x2)
S2TA_IN_GA(x1, x2)  =  S2TA_IN_GA(x1)
U1_GA(x1, x2, x3, x4)  =  U1_GA(x4)
U2_GA(x1, x2, x3, x4)  =  U2_GA(x4)
U3_GA(x1, x2, x3, x4)  =  U3_GA(x4)
U9_G(x1, x2)  =  U9_G(x2)
U10_G(x1, x2)  =  U10_G(x2)
TAPPENDC_IN_GAAA(x1, x2, x3, x4)  =  TAPPENDC_IN_GAAA(x1)
U6_GAAA(x1, x2, x3, x4, x5)  =  U6_GAAA(x5)
TAPPENDB_IN_GAA(x1, x2, x3)  =  TAPPENDB_IN_GAA(x1)
U4_GAA(x1, x2, x3, x4, x5, x6)  =  U4_GAA(x6)
U5_GAA(x1, x2, x3, x4, x5, x6)  =  U5_GAA(x6)
U7_GAAA(x1, x2, x3, x4, x5)  =  U7_GAAA(x5)
U11_G(x1, x2)  =  U11_G(x2)
U12_G(x1, x2)  =  U12_G(x2)
U13_G(x1, x2)  =  U13_G(x2)
U14_G(x1, x2)  =  U14_G(x2)
U15_G(x1, x2)  =  U15_G(x2)
U16_G(x1, x2)  =  U16_G(x2)
U17_G(x1, x2)  =  U17_G(x2)
U18_G(x1)  =  U18_G(x1)

We have to consider all (P,R,Pi)-chains

(6) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

GOALD_IN_G(s(T11)) → U8_G(T11, s2tA_in_ga(T11, X29))
GOALD_IN_G(s(T11)) → S2TA_IN_GA(T11, X29)
S2TA_IN_GA(s(T19), node(X64, X65, X64)) → U1_GA(T19, X64, X65, s2tA_in_ga(T19, X64))
S2TA_IN_GA(s(T19), node(X64, X65, X64)) → S2TA_IN_GA(T19, X64)
S2TA_IN_GA(s(T25), node(nil, X94, X95)) → U2_GA(T25, X94, X95, s2tA_in_ga(T25, X95))
S2TA_IN_GA(s(T25), node(nil, X94, X95)) → S2TA_IN_GA(T25, X95)
S2TA_IN_GA(s(T31), node(X124, X125, nil)) → U3_GA(T31, X124, X125, s2tA_in_ga(T31, X124))
S2TA_IN_GA(s(T31), node(X124, X125, nil)) → S2TA_IN_GA(T31, X124)
GOALD_IN_G(s(T11)) → U9_G(T11, s2tA_in_ga(T11, T13))
U9_G(T11, s2tA_out_ga(T11, T13)) → U10_G(T11, tappendC_in_gaaa(T13, X30, X4, X5))
U9_G(T11, s2tA_out_ga(T11, T13)) → TAPPENDC_IN_GAAA(T13, X30, X4, X5)
TAPPENDC_IN_GAAA(T50, X244, X245, node(X246, X244, T50)) → U6_GAAA(T50, X244, X245, X246, tappendB_in_gaa(T50, X245, X246))
TAPPENDC_IN_GAAA(T50, X244, X245, node(X246, X244, T50)) → TAPPENDB_IN_GAA(T50, X245, X246)
TAPPENDB_IN_GAA(node(T86, T84, T85), X334, node(X335, T84, T85)) → U4_GAA(T86, T84, T85, X334, X335, tappendB_in_gaa(T86, X334, X335))
TAPPENDB_IN_GAA(node(T86, T84, T85), X334, node(X335, T84, T85)) → TAPPENDB_IN_GAA(T86, X334, X335)
TAPPENDB_IN_GAA(node(T93, T94, T96), X359, node(T93, T94, X360)) → U5_GAA(T93, T94, T96, X359, X360, tappendB_in_gaa(T96, X359, X360))
TAPPENDB_IN_GAA(node(T93, T94, T96), X359, node(T93, T94, X360)) → TAPPENDB_IN_GAA(T96, X359, X360)
TAPPENDC_IN_GAAA(T101, X390, X391, node(T101, X390, X392)) → U7_GAAA(T101, X390, X391, X392, tappendB_in_gaa(T101, X391, X392))
TAPPENDC_IN_GAAA(T101, X390, X391, node(T101, X390, X392)) → TAPPENDB_IN_GAA(T101, X391, X392)
GOALD_IN_G(s(T106)) → U11_G(T106, s2tA_in_ga(T106, X421))
GOALD_IN_G(s(T106)) → U12_G(T106, s2tA_in_ga(T106, T108))
U12_G(T106, s2tA_out_ga(T106, T108)) → U13_G(T106, tappendB_in_gaa(node(nil, X420, T108), X4, X5))
U12_G(T106, s2tA_out_ga(T106, T108)) → TAPPENDB_IN_GAA(node(nil, X420, T108), X4, X5)
GOALD_IN_G(s(T114)) → U14_G(T114, s2tA_in_ga(T114, X457))
GOALD_IN_G(s(T114)) → U15_G(T114, s2tA_in_ga(T114, T116))
U15_G(T114, s2tA_out_ga(T114, T116)) → U16_G(T114, tappendB_in_gaa(node(T116, X458, nil), X4, X5))
U15_G(T114, s2tA_out_ga(T114, T116)) → TAPPENDB_IN_GAA(node(T116, X458, nil), X4, X5)
GOALD_IN_G(s(T122)) → U17_G(T122, tappendC_in_gaaa(nil, X485, X4, X5))
GOALD_IN_G(s(T122)) → TAPPENDC_IN_GAAA(nil, X485, X4, X5)
GOALD_IN_G(0) → U18_G(tappendB_in_gaa(nil, X4, X5))
GOALD_IN_G(0) → TAPPENDB_IN_GAA(nil, X4, X5)

The TRS R consists of the following rules:

goalD_in_g(s(T11)) → U8_g(T11, s2tA_in_ga(T11, X29))
s2tA_in_ga(s(T19), node(X64, X65, X64)) → U1_ga(T19, X64, X65, s2tA_in_ga(T19, X64))
s2tA_in_ga(s(T25), node(nil, X94, X95)) → U2_ga(T25, X94, X95, s2tA_in_ga(T25, X95))
s2tA_in_ga(s(T31), node(X124, X125, nil)) → U3_ga(T31, X124, X125, s2tA_in_ga(T31, X124))
s2tA_in_ga(s(T37), node(nil, X145, nil)) → s2tA_out_ga(s(T37), node(nil, X145, nil))
s2tA_in_ga(0, nil) → s2tA_out_ga(0, nil)
U3_ga(T31, X124, X125, s2tA_out_ga(T31, X124)) → s2tA_out_ga(s(T31), node(X124, X125, nil))
U2_ga(T25, X94, X95, s2tA_out_ga(T25, X95)) → s2tA_out_ga(s(T25), node(nil, X94, X95))
U1_ga(T19, X64, X65, s2tA_out_ga(T19, X64)) → s2tA_out_ga(s(T19), node(X64, X65, X64))
U8_g(T11, s2tA_out_ga(T11, X29)) → goalD_out_g(s(T11))
goalD_in_g(s(T11)) → U9_g(T11, s2tA_in_ga(T11, T13))
U9_g(T11, s2tA_out_ga(T11, T13)) → U10_g(T11, tappendC_in_gaaa(T13, X30, X4, X5))
tappendC_in_gaaa(nil, X172, X173, node(X173, X172, nil)) → tappendC_out_gaaa(nil, X172, X173, node(X173, X172, nil))
tappendC_in_gaaa(nil, X197, X198, node(nil, X197, X198)) → tappendC_out_gaaa(nil, X197, X198, node(nil, X197, X198))
tappendC_in_gaaa(T50, X244, X245, node(X246, X244, T50)) → U6_gaaa(T50, X244, X245, X246, tappendB_in_gaa(T50, X245, X246))
tappendB_in_gaa(nil, X260, X260) → tappendB_out_gaa(nil, X260, X260)
tappendB_in_gaa(node(nil, T59, T60), X280, node(X280, T59, T60)) → tappendB_out_gaa(node(nil, T59, T60), X280, node(X280, T59, T60))
tappendB_in_gaa(node(T69, T70, nil), X300, node(T69, T70, X300)) → tappendB_out_gaa(node(T69, T70, nil), X300, node(T69, T70, X300))
tappendB_in_gaa(node(T86, T84, T85), X334, node(X335, T84, T85)) → U4_gaa(T86, T84, T85, X334, X335, tappendB_in_gaa(T86, X334, X335))
tappendB_in_gaa(node(T93, T94, T96), X359, node(T93, T94, X360)) → U5_gaa(T93, T94, T96, X359, X360, tappendB_in_gaa(T96, X359, X360))
U5_gaa(T93, T94, T96, X359, X360, tappendB_out_gaa(T96, X359, X360)) → tappendB_out_gaa(node(T93, T94, T96), X359, node(T93, T94, X360))
U4_gaa(T86, T84, T85, X334, X335, tappendB_out_gaa(T86, X334, X335)) → tappendB_out_gaa(node(T86, T84, T85), X334, node(X335, T84, T85))
U6_gaaa(T50, X244, X245, X246, tappendB_out_gaa(T50, X245, X246)) → tappendC_out_gaaa(T50, X244, X245, node(X246, X244, T50))
tappendC_in_gaaa(T101, X390, X391, node(T101, X390, X392)) → U7_gaaa(T101, X390, X391, X392, tappendB_in_gaa(T101, X391, X392))
U7_gaaa(T101, X390, X391, X392, tappendB_out_gaa(T101, X391, X392)) → tappendC_out_gaaa(T101, X390, X391, node(T101, X390, X392))
U10_g(T11, tappendC_out_gaaa(T13, X30, X4, X5)) → goalD_out_g(s(T11))
goalD_in_g(s(T106)) → U11_g(T106, s2tA_in_ga(T106, X421))
U11_g(T106, s2tA_out_ga(T106, X421)) → goalD_out_g(s(T106))
goalD_in_g(s(T106)) → U12_g(T106, s2tA_in_ga(T106, T108))
U12_g(T106, s2tA_out_ga(T106, T108)) → U13_g(T106, tappendB_in_gaa(node(nil, X420, T108), X4, X5))
U13_g(T106, tappendB_out_gaa(node(nil, X420, T108), X4, X5)) → goalD_out_g(s(T106))
goalD_in_g(s(T114)) → U14_g(T114, s2tA_in_ga(T114, X457))
U14_g(T114, s2tA_out_ga(T114, X457)) → goalD_out_g(s(T114))
goalD_in_g(s(T114)) → U15_g(T114, s2tA_in_ga(T114, T116))
U15_g(T114, s2tA_out_ga(T114, T116)) → U16_g(T114, tappendB_in_gaa(node(T116, X458, nil), X4, X5))
U16_g(T114, tappendB_out_gaa(node(T116, X458, nil), X4, X5)) → goalD_out_g(s(T114))
goalD_in_g(s(T122)) → U17_g(T122, tappendC_in_gaaa(nil, X485, X4, X5))
U17_g(T122, tappendC_out_gaaa(nil, X485, X4, X5)) → goalD_out_g(s(T122))
goalD_in_g(0) → U18_g(tappendB_in_gaa(nil, X4, X5))
U18_g(tappendB_out_gaa(nil, X4, X5)) → goalD_out_g(0)

The argument filtering Pi contains the following mapping:
goalD_in_g(x1)  =  goalD_in_g(x1)
s(x1)  =  s(x1)
U8_g(x1, x2)  =  U8_g(x2)
s2tA_in_ga(x1, x2)  =  s2tA_in_ga(x1)
U1_ga(x1, x2, x3, x4)  =  U1_ga(x4)
U2_ga(x1, x2, x3, x4)  =  U2_ga(x4)
U3_ga(x1, x2, x3, x4)  =  U3_ga(x4)
s2tA_out_ga(x1, x2)  =  s2tA_out_ga(x2)
node(x1, x2, x3)  =  node(x1, x3)
0  =  0
goalD_out_g(x1)  =  goalD_out_g
U9_g(x1, x2)  =  U9_g(x2)
U10_g(x1, x2)  =  U10_g(x2)
tappendC_in_gaaa(x1, x2, x3, x4)  =  tappendC_in_gaaa(x1)
nil  =  nil
tappendC_out_gaaa(x1, x2, x3, x4)  =  tappendC_out_gaaa
U6_gaaa(x1, x2, x3, x4, x5)  =  U6_gaaa(x5)
tappendB_in_gaa(x1, x2, x3)  =  tappendB_in_gaa(x1)
tappendB_out_gaa(x1, x2, x3)  =  tappendB_out_gaa
U4_gaa(x1, x2, x3, x4, x5, x6)  =  U4_gaa(x6)
U5_gaa(x1, x2, x3, x4, x5, x6)  =  U5_gaa(x6)
U7_gaaa(x1, x2, x3, x4, x5)  =  U7_gaaa(x5)
U11_g(x1, x2)  =  U11_g(x2)
U12_g(x1, x2)  =  U12_g(x2)
U13_g(x1, x2)  =  U13_g(x2)
U14_g(x1, x2)  =  U14_g(x2)
U15_g(x1, x2)  =  U15_g(x2)
U16_g(x1, x2)  =  U16_g(x2)
U17_g(x1, x2)  =  U17_g(x2)
U18_g(x1)  =  U18_g(x1)
GOALD_IN_G(x1)  =  GOALD_IN_G(x1)
U8_G(x1, x2)  =  U8_G(x2)
S2TA_IN_GA(x1, x2)  =  S2TA_IN_GA(x1)
U1_GA(x1, x2, x3, x4)  =  U1_GA(x4)
U2_GA(x1, x2, x3, x4)  =  U2_GA(x4)
U3_GA(x1, x2, x3, x4)  =  U3_GA(x4)
U9_G(x1, x2)  =  U9_G(x2)
U10_G(x1, x2)  =  U10_G(x2)
TAPPENDC_IN_GAAA(x1, x2, x3, x4)  =  TAPPENDC_IN_GAAA(x1)
U6_GAAA(x1, x2, x3, x4, x5)  =  U6_GAAA(x5)
TAPPENDB_IN_GAA(x1, x2, x3)  =  TAPPENDB_IN_GAA(x1)
U4_GAA(x1, x2, x3, x4, x5, x6)  =  U4_GAA(x6)
U5_GAA(x1, x2, x3, x4, x5, x6)  =  U5_GAA(x6)
U7_GAAA(x1, x2, x3, x4, x5)  =  U7_GAAA(x5)
U11_G(x1, x2)  =  U11_G(x2)
U12_G(x1, x2)  =  U12_G(x2)
U13_G(x1, x2)  =  U13_G(x2)
U14_G(x1, x2)  =  U14_G(x2)
U15_G(x1, x2)  =  U15_G(x2)
U16_G(x1, x2)  =  U16_G(x2)
U17_G(x1, x2)  =  U17_G(x2)
U18_G(x1)  =  U18_G(x1)

We have to consider all (P,R,Pi)-chains

(7) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LOPSTR] contains 2 SCCs with 26 less nodes.

(8) Complex Obligation (AND)

(9) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

TAPPENDB_IN_GAA(node(T93, T94, T96), X359, node(T93, T94, X360)) → TAPPENDB_IN_GAA(T96, X359, X360)
TAPPENDB_IN_GAA(node(T86, T84, T85), X334, node(X335, T84, T85)) → TAPPENDB_IN_GAA(T86, X334, X335)

The TRS R consists of the following rules:

goalD_in_g(s(T11)) → U8_g(T11, s2tA_in_ga(T11, X29))
s2tA_in_ga(s(T19), node(X64, X65, X64)) → U1_ga(T19, X64, X65, s2tA_in_ga(T19, X64))
s2tA_in_ga(s(T25), node(nil, X94, X95)) → U2_ga(T25, X94, X95, s2tA_in_ga(T25, X95))
s2tA_in_ga(s(T31), node(X124, X125, nil)) → U3_ga(T31, X124, X125, s2tA_in_ga(T31, X124))
s2tA_in_ga(s(T37), node(nil, X145, nil)) → s2tA_out_ga(s(T37), node(nil, X145, nil))
s2tA_in_ga(0, nil) → s2tA_out_ga(0, nil)
U3_ga(T31, X124, X125, s2tA_out_ga(T31, X124)) → s2tA_out_ga(s(T31), node(X124, X125, nil))
U2_ga(T25, X94, X95, s2tA_out_ga(T25, X95)) → s2tA_out_ga(s(T25), node(nil, X94, X95))
U1_ga(T19, X64, X65, s2tA_out_ga(T19, X64)) → s2tA_out_ga(s(T19), node(X64, X65, X64))
U8_g(T11, s2tA_out_ga(T11, X29)) → goalD_out_g(s(T11))
goalD_in_g(s(T11)) → U9_g(T11, s2tA_in_ga(T11, T13))
U9_g(T11, s2tA_out_ga(T11, T13)) → U10_g(T11, tappendC_in_gaaa(T13, X30, X4, X5))
tappendC_in_gaaa(nil, X172, X173, node(X173, X172, nil)) → tappendC_out_gaaa(nil, X172, X173, node(X173, X172, nil))
tappendC_in_gaaa(nil, X197, X198, node(nil, X197, X198)) → tappendC_out_gaaa(nil, X197, X198, node(nil, X197, X198))
tappendC_in_gaaa(T50, X244, X245, node(X246, X244, T50)) → U6_gaaa(T50, X244, X245, X246, tappendB_in_gaa(T50, X245, X246))
tappendB_in_gaa(nil, X260, X260) → tappendB_out_gaa(nil, X260, X260)
tappendB_in_gaa(node(nil, T59, T60), X280, node(X280, T59, T60)) → tappendB_out_gaa(node(nil, T59, T60), X280, node(X280, T59, T60))
tappendB_in_gaa(node(T69, T70, nil), X300, node(T69, T70, X300)) → tappendB_out_gaa(node(T69, T70, nil), X300, node(T69, T70, X300))
tappendB_in_gaa(node(T86, T84, T85), X334, node(X335, T84, T85)) → U4_gaa(T86, T84, T85, X334, X335, tappendB_in_gaa(T86, X334, X335))
tappendB_in_gaa(node(T93, T94, T96), X359, node(T93, T94, X360)) → U5_gaa(T93, T94, T96, X359, X360, tappendB_in_gaa(T96, X359, X360))
U5_gaa(T93, T94, T96, X359, X360, tappendB_out_gaa(T96, X359, X360)) → tappendB_out_gaa(node(T93, T94, T96), X359, node(T93, T94, X360))
U4_gaa(T86, T84, T85, X334, X335, tappendB_out_gaa(T86, X334, X335)) → tappendB_out_gaa(node(T86, T84, T85), X334, node(X335, T84, T85))
U6_gaaa(T50, X244, X245, X246, tappendB_out_gaa(T50, X245, X246)) → tappendC_out_gaaa(T50, X244, X245, node(X246, X244, T50))
tappendC_in_gaaa(T101, X390, X391, node(T101, X390, X392)) → U7_gaaa(T101, X390, X391, X392, tappendB_in_gaa(T101, X391, X392))
U7_gaaa(T101, X390, X391, X392, tappendB_out_gaa(T101, X391, X392)) → tappendC_out_gaaa(T101, X390, X391, node(T101, X390, X392))
U10_g(T11, tappendC_out_gaaa(T13, X30, X4, X5)) → goalD_out_g(s(T11))
goalD_in_g(s(T106)) → U11_g(T106, s2tA_in_ga(T106, X421))
U11_g(T106, s2tA_out_ga(T106, X421)) → goalD_out_g(s(T106))
goalD_in_g(s(T106)) → U12_g(T106, s2tA_in_ga(T106, T108))
U12_g(T106, s2tA_out_ga(T106, T108)) → U13_g(T106, tappendB_in_gaa(node(nil, X420, T108), X4, X5))
U13_g(T106, tappendB_out_gaa(node(nil, X420, T108), X4, X5)) → goalD_out_g(s(T106))
goalD_in_g(s(T114)) → U14_g(T114, s2tA_in_ga(T114, X457))
U14_g(T114, s2tA_out_ga(T114, X457)) → goalD_out_g(s(T114))
goalD_in_g(s(T114)) → U15_g(T114, s2tA_in_ga(T114, T116))
U15_g(T114, s2tA_out_ga(T114, T116)) → U16_g(T114, tappendB_in_gaa(node(T116, X458, nil), X4, X5))
U16_g(T114, tappendB_out_gaa(node(T116, X458, nil), X4, X5)) → goalD_out_g(s(T114))
goalD_in_g(s(T122)) → U17_g(T122, tappendC_in_gaaa(nil, X485, X4, X5))
U17_g(T122, tappendC_out_gaaa(nil, X485, X4, X5)) → goalD_out_g(s(T122))
goalD_in_g(0) → U18_g(tappendB_in_gaa(nil, X4, X5))
U18_g(tappendB_out_gaa(nil, X4, X5)) → goalD_out_g(0)

The argument filtering Pi contains the following mapping:
goalD_in_g(x1)  =  goalD_in_g(x1)
s(x1)  =  s(x1)
U8_g(x1, x2)  =  U8_g(x2)
s2tA_in_ga(x1, x2)  =  s2tA_in_ga(x1)
U1_ga(x1, x2, x3, x4)  =  U1_ga(x4)
U2_ga(x1, x2, x3, x4)  =  U2_ga(x4)
U3_ga(x1, x2, x3, x4)  =  U3_ga(x4)
s2tA_out_ga(x1, x2)  =  s2tA_out_ga(x2)
node(x1, x2, x3)  =  node(x1, x3)
0  =  0
goalD_out_g(x1)  =  goalD_out_g
U9_g(x1, x2)  =  U9_g(x2)
U10_g(x1, x2)  =  U10_g(x2)
tappendC_in_gaaa(x1, x2, x3, x4)  =  tappendC_in_gaaa(x1)
nil  =  nil
tappendC_out_gaaa(x1, x2, x3, x4)  =  tappendC_out_gaaa
U6_gaaa(x1, x2, x3, x4, x5)  =  U6_gaaa(x5)
tappendB_in_gaa(x1, x2, x3)  =  tappendB_in_gaa(x1)
tappendB_out_gaa(x1, x2, x3)  =  tappendB_out_gaa
U4_gaa(x1, x2, x3, x4, x5, x6)  =  U4_gaa(x6)
U5_gaa(x1, x2, x3, x4, x5, x6)  =  U5_gaa(x6)
U7_gaaa(x1, x2, x3, x4, x5)  =  U7_gaaa(x5)
U11_g(x1, x2)  =  U11_g(x2)
U12_g(x1, x2)  =  U12_g(x2)
U13_g(x1, x2)  =  U13_g(x2)
U14_g(x1, x2)  =  U14_g(x2)
U15_g(x1, x2)  =  U15_g(x2)
U16_g(x1, x2)  =  U16_g(x2)
U17_g(x1, x2)  =  U17_g(x2)
U18_g(x1)  =  U18_g(x1)
TAPPENDB_IN_GAA(x1, x2, x3)  =  TAPPENDB_IN_GAA(x1)

We have to consider all (P,R,Pi)-chains

(10) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(11) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

TAPPENDB_IN_GAA(node(T93, T94, T96), X359, node(T93, T94, X360)) → TAPPENDB_IN_GAA(T96, X359, X360)
TAPPENDB_IN_GAA(node(T86, T84, T85), X334, node(X335, T84, T85)) → TAPPENDB_IN_GAA(T86, X334, X335)

R is empty.
The argument filtering Pi contains the following mapping:
node(x1, x2, x3)  =  node(x1, x3)
TAPPENDB_IN_GAA(x1, x2, x3)  =  TAPPENDB_IN_GAA(x1)

We have to consider all (P,R,Pi)-chains

(12) PiDPToQDPProof (SOUND transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(13) Obligation:

Q DP problem:
The TRS P consists of the following rules:

TAPPENDB_IN_GAA(node(T93, T96)) → TAPPENDB_IN_GAA(T96)
TAPPENDB_IN_GAA(node(T86, T85)) → TAPPENDB_IN_GAA(T86)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.

(14) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

  • TAPPENDB_IN_GAA(node(T93, T96)) → TAPPENDB_IN_GAA(T96)
    The graph contains the following edges 1 > 1

  • TAPPENDB_IN_GAA(node(T86, T85)) → TAPPENDB_IN_GAA(T86)
    The graph contains the following edges 1 > 1

(15) YES

(16) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

S2TA_IN_GA(s(T25), node(nil, X94, X95)) → S2TA_IN_GA(T25, X95)
S2TA_IN_GA(s(T19), node(X64, X65, X64)) → S2TA_IN_GA(T19, X64)
S2TA_IN_GA(s(T31), node(X124, X125, nil)) → S2TA_IN_GA(T31, X124)

The TRS R consists of the following rules:

goalD_in_g(s(T11)) → U8_g(T11, s2tA_in_ga(T11, X29))
s2tA_in_ga(s(T19), node(X64, X65, X64)) → U1_ga(T19, X64, X65, s2tA_in_ga(T19, X64))
s2tA_in_ga(s(T25), node(nil, X94, X95)) → U2_ga(T25, X94, X95, s2tA_in_ga(T25, X95))
s2tA_in_ga(s(T31), node(X124, X125, nil)) → U3_ga(T31, X124, X125, s2tA_in_ga(T31, X124))
s2tA_in_ga(s(T37), node(nil, X145, nil)) → s2tA_out_ga(s(T37), node(nil, X145, nil))
s2tA_in_ga(0, nil) → s2tA_out_ga(0, nil)
U3_ga(T31, X124, X125, s2tA_out_ga(T31, X124)) → s2tA_out_ga(s(T31), node(X124, X125, nil))
U2_ga(T25, X94, X95, s2tA_out_ga(T25, X95)) → s2tA_out_ga(s(T25), node(nil, X94, X95))
U1_ga(T19, X64, X65, s2tA_out_ga(T19, X64)) → s2tA_out_ga(s(T19), node(X64, X65, X64))
U8_g(T11, s2tA_out_ga(T11, X29)) → goalD_out_g(s(T11))
goalD_in_g(s(T11)) → U9_g(T11, s2tA_in_ga(T11, T13))
U9_g(T11, s2tA_out_ga(T11, T13)) → U10_g(T11, tappendC_in_gaaa(T13, X30, X4, X5))
tappendC_in_gaaa(nil, X172, X173, node(X173, X172, nil)) → tappendC_out_gaaa(nil, X172, X173, node(X173, X172, nil))
tappendC_in_gaaa(nil, X197, X198, node(nil, X197, X198)) → tappendC_out_gaaa(nil, X197, X198, node(nil, X197, X198))
tappendC_in_gaaa(T50, X244, X245, node(X246, X244, T50)) → U6_gaaa(T50, X244, X245, X246, tappendB_in_gaa(T50, X245, X246))
tappendB_in_gaa(nil, X260, X260) → tappendB_out_gaa(nil, X260, X260)
tappendB_in_gaa(node(nil, T59, T60), X280, node(X280, T59, T60)) → tappendB_out_gaa(node(nil, T59, T60), X280, node(X280, T59, T60))
tappendB_in_gaa(node(T69, T70, nil), X300, node(T69, T70, X300)) → tappendB_out_gaa(node(T69, T70, nil), X300, node(T69, T70, X300))
tappendB_in_gaa(node(T86, T84, T85), X334, node(X335, T84, T85)) → U4_gaa(T86, T84, T85, X334, X335, tappendB_in_gaa(T86, X334, X335))
tappendB_in_gaa(node(T93, T94, T96), X359, node(T93, T94, X360)) → U5_gaa(T93, T94, T96, X359, X360, tappendB_in_gaa(T96, X359, X360))
U5_gaa(T93, T94, T96, X359, X360, tappendB_out_gaa(T96, X359, X360)) → tappendB_out_gaa(node(T93, T94, T96), X359, node(T93, T94, X360))
U4_gaa(T86, T84, T85, X334, X335, tappendB_out_gaa(T86, X334, X335)) → tappendB_out_gaa(node(T86, T84, T85), X334, node(X335, T84, T85))
U6_gaaa(T50, X244, X245, X246, tappendB_out_gaa(T50, X245, X246)) → tappendC_out_gaaa(T50, X244, X245, node(X246, X244, T50))
tappendC_in_gaaa(T101, X390, X391, node(T101, X390, X392)) → U7_gaaa(T101, X390, X391, X392, tappendB_in_gaa(T101, X391, X392))
U7_gaaa(T101, X390, X391, X392, tappendB_out_gaa(T101, X391, X392)) → tappendC_out_gaaa(T101, X390, X391, node(T101, X390, X392))
U10_g(T11, tappendC_out_gaaa(T13, X30, X4, X5)) → goalD_out_g(s(T11))
goalD_in_g(s(T106)) → U11_g(T106, s2tA_in_ga(T106, X421))
U11_g(T106, s2tA_out_ga(T106, X421)) → goalD_out_g(s(T106))
goalD_in_g(s(T106)) → U12_g(T106, s2tA_in_ga(T106, T108))
U12_g(T106, s2tA_out_ga(T106, T108)) → U13_g(T106, tappendB_in_gaa(node(nil, X420, T108), X4, X5))
U13_g(T106, tappendB_out_gaa(node(nil, X420, T108), X4, X5)) → goalD_out_g(s(T106))
goalD_in_g(s(T114)) → U14_g(T114, s2tA_in_ga(T114, X457))
U14_g(T114, s2tA_out_ga(T114, X457)) → goalD_out_g(s(T114))
goalD_in_g(s(T114)) → U15_g(T114, s2tA_in_ga(T114, T116))
U15_g(T114, s2tA_out_ga(T114, T116)) → U16_g(T114, tappendB_in_gaa(node(T116, X458, nil), X4, X5))
U16_g(T114, tappendB_out_gaa(node(T116, X458, nil), X4, X5)) → goalD_out_g(s(T114))
goalD_in_g(s(T122)) → U17_g(T122, tappendC_in_gaaa(nil, X485, X4, X5))
U17_g(T122, tappendC_out_gaaa(nil, X485, X4, X5)) → goalD_out_g(s(T122))
goalD_in_g(0) → U18_g(tappendB_in_gaa(nil, X4, X5))
U18_g(tappendB_out_gaa(nil, X4, X5)) → goalD_out_g(0)

The argument filtering Pi contains the following mapping:
goalD_in_g(x1)  =  goalD_in_g(x1)
s(x1)  =  s(x1)
U8_g(x1, x2)  =  U8_g(x2)
s2tA_in_ga(x1, x2)  =  s2tA_in_ga(x1)
U1_ga(x1, x2, x3, x4)  =  U1_ga(x4)
U2_ga(x1, x2, x3, x4)  =  U2_ga(x4)
U3_ga(x1, x2, x3, x4)  =  U3_ga(x4)
s2tA_out_ga(x1, x2)  =  s2tA_out_ga(x2)
node(x1, x2, x3)  =  node(x1, x3)
0  =  0
goalD_out_g(x1)  =  goalD_out_g
U9_g(x1, x2)  =  U9_g(x2)
U10_g(x1, x2)  =  U10_g(x2)
tappendC_in_gaaa(x1, x2, x3, x4)  =  tappendC_in_gaaa(x1)
nil  =  nil
tappendC_out_gaaa(x1, x2, x3, x4)  =  tappendC_out_gaaa
U6_gaaa(x1, x2, x3, x4, x5)  =  U6_gaaa(x5)
tappendB_in_gaa(x1, x2, x3)  =  tappendB_in_gaa(x1)
tappendB_out_gaa(x1, x2, x3)  =  tappendB_out_gaa
U4_gaa(x1, x2, x3, x4, x5, x6)  =  U4_gaa(x6)
U5_gaa(x1, x2, x3, x4, x5, x6)  =  U5_gaa(x6)
U7_gaaa(x1, x2, x3, x4, x5)  =  U7_gaaa(x5)
U11_g(x1, x2)  =  U11_g(x2)
U12_g(x1, x2)  =  U12_g(x2)
U13_g(x1, x2)  =  U13_g(x2)
U14_g(x1, x2)  =  U14_g(x2)
U15_g(x1, x2)  =  U15_g(x2)
U16_g(x1, x2)  =  U16_g(x2)
U17_g(x1, x2)  =  U17_g(x2)
U18_g(x1)  =  U18_g(x1)
S2TA_IN_GA(x1, x2)  =  S2TA_IN_GA(x1)

We have to consider all (P,R,Pi)-chains

(17) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(18) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

S2TA_IN_GA(s(T25), node(nil, X94, X95)) → S2TA_IN_GA(T25, X95)
S2TA_IN_GA(s(T19), node(X64, X65, X64)) → S2TA_IN_GA(T19, X64)
S2TA_IN_GA(s(T31), node(X124, X125, nil)) → S2TA_IN_GA(T31, X124)

R is empty.
The argument filtering Pi contains the following mapping:
s(x1)  =  s(x1)
node(x1, x2, x3)  =  node(x1, x3)
nil  =  nil
S2TA_IN_GA(x1, x2)  =  S2TA_IN_GA(x1)

We have to consider all (P,R,Pi)-chains

(19) PiDPToQDPProof (SOUND transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(20) Obligation:

Q DP problem:
The TRS P consists of the following rules:

S2TA_IN_GA(s(T25)) → S2TA_IN_GA(T25)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.

(21) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

  • S2TA_IN_GA(s(T25)) → S2TA_IN_GA(T25)
    The graph contains the following edges 1 > 1

(22) YES